Graded polynomial identities and codimensions: Computing the exponential growth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Abel-Type Polynomial Identities

The Abel identity is (x + y) = n ∑ i=0 ( n i ) x(x − iz)i−1(y + iz)n−i, where x, y and z are real numbers. In this paper we deduce several polynomials expansions, referred to as Abel-type identities, by using Foata’s method, and also show some of their applications.

متن کامل

The Polynomial - Exponential Equation

We solve the equation of the title for q = 3 and, partially, for q = 2. These are the only prime values of q for which there exist integer solutions. Our arguments are based upon off-diagonal Padé approximation to the binomial function.

متن کامل

Algebras, Dialgebras, and Polynomial Identities *

This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras, and the corresponding dialgebras; the KP algorithm for converting identities for algebras into identities for dialgebras; the BSO algorithm for converting oper...

متن کامل

Polynomial identities for partitions

For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...

متن کامل

Interprocedurally Analyzing Polynomial Identities

Since programming languages are Turing complete, it is impossible to decide for all programs whether a given non-trivial semantic property is valid or not. The way-out chosen by abstract interpretation is to provide approximate methods which may fail to certify a program property on some programs. Precision of the analysis can be measured by providing classes of programs for which the analysis ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2010

ISSN: 0001-8708

DOI: 10.1016/j.aim.2010.03.013